Evaluation of Jacobian Matrices for Newton’s Method with Deflation to approximate Isolated Singular Solutions of Polynomial Systems
نویسندگان
چکیده
For isolated singular solutions of polynomial systems, we can restore the quadratic convergence of Newton’s method by deflation. The number of deflation stages is bounded by the multiplicity of the root. A preliminary implementation performs well in case only a few deflation stages are needed, but suffers from expression swell as the number of deflation stages grows. In this paper we describe how a directed acyclic graph of derivative operators guides an efficient evaluation of the Jacobian matrices produced by our deflation algorithm. We illustrate how the symbolic-numeric deflation algorithm can be used within PHCmaple interfacing Maple with PHCpack. Mathematics Subject Classification (2000). Primary 65H10; Secondary 14Q99, 68W30.
منابع مشابه
Computing Isolated Singular Solutions of Polynomial Systems: Case of Breadth One
We present a symbolic-numeric method to refine an approximate isolated singular solution x̂ = (x̂1, . . . , x̂n) of a polynomial system F = {f1, . . . , fn}, when the Jacobian matrix of F evaluated at x̂ has corank one approximately. Our new approach is based on the regularized Newton iteration and the computation of differential conditions satisfied at the approximate singular solution. The size o...
متن کاملHigher-Order Deflation for Polynomial Systems with Isolated Singular Solutions
Given an approximation to a multiple isolated solution of a polynomial system of equations, we have provided a symbolic-numeric deflation algorithm to restore the quadratic convergence of Newton’s method. Using first-order derivatives of the polynomials in the system, our method creates an augmented system of equations which has the multiple isolated solution of the original system as a regular...
متن کاملNewton's method with deflation for isolated singularities of polynomial systems
We present a modification of Newton’s method to restore quadratic convergence for isolated singular solutions of polynomial systems. Our method is symbolic-numeric: we produce a new polynomial system which has the original multiple solution as a regular root. We show that the number of deflation stages is bounded by the multiplicity of the isolated root. Our implementation performs well on a la...
متن کاملOn deflation and multiplicity structure
This paper presents two new constructions related to singular solutions of polynomial systems. The first is a new deflation method for an isolated singular root. This construction uses a single linear differential form defined from the Jacobian matrix of the input, and defines the deflated system by applying this differential form to the original system. The advantages of this new deflation is ...
متن کاملNumerical Solution of Optimal Control of Time-varying Singular Systems via Operational Matrices
In this paper, a numerical method for solving the constrained optimal control of time-varying singular systems with quadratic performance index is presented. Presented method is based on Bernste in polynomials. Operational matrices of integration, differentiation and product are introduced and utilized to reduce the optimal control of time-varying singular problems to the solution of algebraic ...
متن کامل